Smart Tile Self-Assembly and Replication

نویسندگان

  • Lila Kari
  • Amirhossein Simjour
چکیده

We propose the concept of self-assembly of smart tiles, i.e., tiles which possess a local computational device in addition to having edge glues that can be activated or deactivated by signals. We demonstrate the potential of self-assembly with smart tiles to efficiently perform robotic tasks such as the replication of convex shapes. The smart tile assembly system we construct does not make any assumption on the glues and signals of the interior tiles of the input supertile, and uses a scaffold to assemble a replica underneath it. The tile local computational device can range from its being absent to being a counter, a simple look-up table, a finite state machine, all the way to being a Turing machine. Thus, this model offers a general framework to discuss and compare various tile self-assembly systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Self-assembly Model of Time-Dependent Glue Strength

We propose a reversible self-assembly model in which the glue strength between two juxtaposed tiles is a function of the time they have been in neighboring positions. We then present an implementation of our model using strand displacement reactions on DNA tiles. Under our model, we can for the first time demonstrate and study catalysis and self-replication in the tile assembly rigorously. We t...

متن کامل

Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles

Jacob Hendricks , Matthew J. Patitz , and Trent A. Rogers ? ? ? Abstract. In this paper, we investigate the abilities of systems of selfassembling tiles which can each pass a constant number of signals to their immediate neighbors to create replicas of input shapes. Namely, we work within the Signal-passing Tile Assembly Model (STAM), and we provide a universal STAM tile set which is capable of...

متن کامل

Formal Verification of Self-Assembling Systems

This paper introduces the theory and practice of formal verification of self-assembling systems. We interpret a well-studied abstraction of nanomolecular self assembly, the Abstract Tile Assembly Model (aTAM), into Computation Tree Logic (CTL), a temporal logic often used in model checking. We then consider the class of “rectilinear” tile assembly systems. This class includes most aTAM systems ...

متن کامل

Randomized Self-assembly for Approximate Shapes

In this paper we design tile self-assembly systems which assemble arbitrarily close approximations to target squares with arbitrarily high probability. This is in contrast to previous work which has only considered deterministic assemblies of a single shape. Our technique takes advantage of the ability to assign tile concentrations to each tile type of a self-assembly system. Such an assignment...

متن کامل

Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces

We show how to design a universal shape replicator in a selfassembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown holefree polyomino shape, produces an unbounded number of copies of that shape (plus constant-size garbage objects). The constant-size objects can be easily constructe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Fundam. Inform.

دوره 154  شماره 

صفحات  -

تاریخ انتشار 2017